例句與造句

1. Optimum route sequence search in petri net based on ant colony algorithm
   基于蟻群算法的petri網(wǎng)最優(yōu)路徑序列尋找
2. The simulation on synthetic data and stock index is demonstrated . 3 ) for fast sub trend sequence searching , a various steps algorithm is proposed based on analyzing the similarity of adjacent sub series distance
   并分別對(duì)人工數(shù)據(jù)和股票指數(shù)進(jìn)行仿真計(jì)算； 3 )通過分析相鄰子序列趨勢距離的相似性，提出一種變步長趨勢子序列快速搜索算法。
3. In this paper , a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software . especially , all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system , similarity full binary sort tree , a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation . and all of the arithmetic are designed with mcs - 51 assembly language . the quick search arithmetic , in which merits of both binary search and sequence search are used fully , are based on the specialty of preorder traversal in similarity full binary sort tree
   特別在軟件設(shè)計(jì)研究中，提出了適用于數(shù)據(jù)采集系統(tǒng)的數(shù)據(jù)壓縮算法? ?基于字典模型的自適應(yīng)壓縮算法；提出了類滿二叉排序樹的定義；提出了基于類滿二叉排序樹的先序遍歷特性的最優(yōu)化快速查找算法，它充分利用了折半查找和順序查找各自的優(yōu)點(diǎn)；提出了浮點(diǎn)運(yùn)算乘法的改進(jìn)算法；并在mcs - 51匯編語言層次上對(duì)所有的算法加以實(shí)現(xiàn)。
4. It's difficult to find sequence search in a sentence. 用sequence search造句挺難的